AND/OR Cutset Conditioning
نویسندگان
چکیده
Cutset conditioning is one of the methods of solving reasoning tasks for graphical models, especially when space restrictions make inference (e.g., jointree-clustering) algorithms infeasible. The wcutset is a natural extention of the method to a hybrid algoritm that performs search on the conditioning variables and inference on the remaining problems of induced width bounded by w. This paper takes a fresh look at these methods through the spectrum of AND/OR search spaces for graphical models. The resulting AND/OR cutset method is a strict improvement over the traditional one, often by exponential amounts.
منابع مشابه
Randomized Algorithms for the Loop
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference. Our randomized algorithm for nding a loop cutset outputs a minimum loop cutset after O(c 6 k kn) steps with probability at least 1 ? (1 ? 1 6 k) c6 k , where c > 1 is a constant speciied by the user, k is the minimal ...
متن کاملCutset Networks: A Simple, Tractable, and Scalable Approach for Improving the Accuracy of Chow-Liu Trees
In this paper, we present cutset networks, a new tractable probabilistic model for representing multi-dimensional discrete distributions. Cutset networks are rooted OR search trees, in which each OR node represents conditioning of a variable in the model, with tree Bayesian networks (Chow-Liu trees) at the leaves. From an inference point of view, cutset networks model the mechanics of Pearl’s c...
متن کاملA combination of cutset conditioning with clique-tree propagation in the Pathfinder system
Cutset conditioning and clique-tree propagation are two popular methods for performing exact probabilistic inference in Bayesian belief networks. Cutset conditioning is based on decomposition of a subset of network nodes, whereas clique-tree propagation depends on aggregation of nodes. We describe a means to combine cutset conditioning and clique- tree propagation in an approach called aggregat...
متن کاملA combination of exact algorithms for inference on Bayesian belief networks
Cutset conditioning and clique-tree propagation are two popular methods for exact probabilistic inference in Bayesian belief networks. Cutset conditioning is based on decomposition of a subset of network nodes, whereas clique-tree propagation depends on aggregation of nodes. We characterize network structures in which the performances of these methods differ. We describe a means to combine cuts...
متن کاملCutset sampling for Bayesian networks Cutset sampling for Bayesian networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network structure-exploiting application of the Rao-Blackwellisation principle to sampling in Bayesian networks. It improves convergence by exploiting memory-based inference algorithms. It can also be viewed as an anytime appro...
متن کامل